Extending substructure based iterative solvers to multiple load and repeated analyses

Efficient Iterative Solvers for Angle Based Flattening

In this paper, we derive an efficient approach for solving the optimization problem which arises in Angle Based Flattening. As the size of system matrix associated with the ABF blows up to a size approximately five times the number of faces, finding a solution for reasonably sized triangular meshes becomes a challenging problem. We propose two iterative approaches to overcome these limitations....

Extending SAT Solvers to Cryptographic Problems

Abstract. Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain problems and have successfully been used to test hardness assumptions. This paper extends a SAT solver to efficiently work on cryptographic problems. The paper further illustrates how SAT solvers process cryp...

Closer to the solution: Iterative linear solvers

Coupling Iterative Subsystem Solvers

We sketch an algorithmic framework to integrate (iterative) solvers of subsystems of a large nonlinear system into a joint iterative solution process.

Combining Numerical Iterative Solvers

Given a linear system there are several solvers which can be used to solve it. However, according to the properties of the linear system different solvers may have different convergence speeds, or may even not converge at all. Nevertheless, it can be difficult to verify these properties in practice, mainly due to rounding errors, and there are also some cases where no direct property can be use...